Discrete Cosine Transforms on Quantum Computers
نویسندگان
چکیده
A classical computer does not allow to calculate a discrete cosine transform on N points in less than linear time. This trivial lower bound is no longer valid for a computer that takes advantage of quantum mechanical superposition, entanglement, and interference principles. In fact, we show that it is possible to realize the discrete cosine transforms and the discrete sine transforms of size N N and types I,II,III, and IV with as little as O(log2N) operations on a quantum computer, whereas the known fast algorithms on a classical computer need O(N logN) operations.
منابع مشابه
Fast Signal Transforms for Quantum
We present the discrete Fourier transform as a basic primitive in the treatment of controlled quantum systems. Based on the complexity model for quantum circuits the Fourier transform of size 2 n surprisingly can be realised with O(n 2) elementary operations which is an exponential speedup compared to the classical case. This is the reason for its presence in almost all known quantum algorithms...
متن کاملLarge quantum Fourier transforms are never exactly realized by braiding conformal blocks
Fourier transform is an essential ingredient in Shor’s factoring algorithm. In the standard quantum circuit model with the gate set U 2 , controlled-NOT , the discrete Fourier transforms FN= ij N N, i , j=0,1 ,... ,N −1, =e2 i/N, can be realized exactly by quantum circuits of size O n2 , n=ln N, and so can the discrete sine or cosine transforms. In topological quantum computing, the simplest un...
متن کاملBlock diagonal structure in discrete transforms - Computers and Digital Techniques [see also IEE Proceedings-Computers and Digital Techniques], IEE
The author investigates and summarises some of the computational tasks of discrete transforms in which block diagonal structure plays a dominant role. Walsh-Hadamard transform (WHT) based algorithm designs for various well known discrete transforms are presented; it can be proved that, owing to their block diagonal structure, the WHT based discrete transforms are more efficient than those of th...
متن کاملOn the Irresistible Efficiency of Signal Processing Methods in Quantum Computing
We show that many well-known signal transforms allow highly efficient realizations on a quantum computer. We explain some elementary quantum circuits and review the construction of the Quantum Fourier Transform. We derive quantum circuits for the Discrete Cosine and Sine Transforms, and for the Discrete Hartley transform. We show that at most O(log N) elementary quantum gates are necessary to i...
متن کاملNon-linear Fourier optics in computers: a challenge for hybrid digital-optical image processors
In the paper, a family of methods that work in the domain of Discrete Fourier and Discrete cosine transforms and proved to be very efficient for adaptive and local adaptive image restoration and target location is reviewed and possible ways for their implementation in analog optical image processors that work with the speed of light are discussed. ©Anita Publications reserved. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001